New systematic easy decoding symmetric rank codes
نویسنده
چکیده
A family of rank-metric codes over binary fields with lengths Ns = 2, s = 0, 1, . . . , is constructed. Codes of length Ns are designed recursively from codes of length Ns−1. This provides very high degree of symmetry of code matrices. In turn, it allows to decode corrupted received matrices recursively starting with small lengths. The construction allows to use many simple algorithms for decoding in rank metric such as majority rules and similar.
منابع مشابه
Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملA Decoding Algorithm for Rank Metric Codes
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...
متن کاملOptimal, systematic, q-ary codes correcting all asymmetric and symmetric errors of limited magnitude
Systematic -ary ( ) codes capable of correcting all asymmetric errors of maximum magnitude , where , are given. These codes are shown to be optimal. Further, simple encoding/decoding algorithms are described. The proposed code can be modified to design codes correcting all symmetric errors of maximum magnitude , where .
متن کاملSpherical codes generated by binary partitions of symmetric pointsets
Recently, Ericson and Zinoviev presented a clever, new construction for spherical codes for the Gaussian channel using ideas of code concatenation and set partitioning. This family of new spherical codes is generated from sets of binary codes using equally spaced symmetric pointsets on the real line. The family contains some of the best known spherical codes in terms of minimum distance. Howeve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008